Stochastically Enhanced Timed Automata
نویسندگان
چکیده
In our previous work, we have been interested in the development of methodologies and techniques for the specification and verification of distributed multimedia systems, with particular emphasis on object and component-based systems [Blair98a]. This has led us to develop an aspect-oriented style of specification that follows the principles of aspect-oriented programming [AOP00][Murphy99]. Essentially, we decompose a system specification into four aspects: functional, non-functional, management and requirements. Motivations for this choice can be found in [Blair99c]. In the (aspect) programming world, once written, the aspects must be woven together using a set of identified join-points. There is a nice parallel here with aspects in a specification world: once written, our aspects are composed together (using standard parallel composition rules) and the join-points become the set of actions (events) on
منابع مشابه
Using Interval Petri Nets and Timed Automata for Diagnosis of Discrete Event Systems (DES)
A discrete event system (DES) is a dynamic system that evolves in accordance with the abrupt occurrence, at possibly unknown irregular intervals, of physical events. Because of the special nature of these systems, different tools are currently used for their analysis, design and modeling. The main focus of this paper is the presentation of a new modeling approach of Discrete Event Systems. The ...
متن کاملCompositions of (max, +) automata
Abstract: Automata with weights (multiplicities) in the so called (max,+) semiring constitute a class of timed automata. Their modeling power has been studied in Gaubert and Mairesse (1999): at least timed safe Petri nets can be modeled by means of (max,+) automata. In this contribution, we define compositions for (max,+) automata. The motivation is to be able to model a complex system by compo...
متن کاملAn Enhancement of Timed Automata Generation from Timed Scenarios Using Grouped States
Scenarios are partial behavior descriptions, used to represent users requirements as a basis for speciication construction. We have developed a basic algorithm which incrementally constructs timed automata from scenarios with timing constraints. The algorithm uses operations semantics and conditions to deene states. In this paper, the complexity of this basic algorithm is discussed and it is en...
متن کامل8 th Workshop on Process Algebra and Stochastically Timed Activities PASTA 2009
Discreteness and continuity are two opposite ways of describing the world. However, there are many situations, from engines to cells, in which an hybrid description, mixing both such ingredients, seems more adequate. In this presentation, we focus on stochastic hybrid systems. We present Piecewise Deterministic Markov Processes, and we provide a simpler description language, Transition-Driven S...
متن کاملRecursive Timed Automata
We study recursive timed automata that extend timed automata with recursion. Timed automata, as introduced by Alur and Dill, are finite automata accompanied by a finite set of real-valued variables called clocks. Recursive timed automata are finite collections of timed automata extended with special states that correspond to (potentially recursive) invocations of other timed automata from their...
متن کامل